A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs
نویسندگان
چکیده
We consider in this note the maximum integral two-commodity flow problem in augmented planar graphs, that is with both sourceesink edges added. We provide an O(n&) simple algorithm for finding a maximum integral two-commodity flow in augmented planar graphs.
منابع مشابه
0 61 7 - 19 90
We consider the maximum integral tWo-Commodity flow problem in augmented planar graphs (i.e., with both source-sink edges added) and provide an o(IVI 2 1ogIVI) algorithm for that problem. Let G = (V, E) be a graph and w : E-t Z+ a weight function. Let T C V be an even subset of the vertices of G. A T-cut is an edge-cutset of the graph which divides T into two odd sets. Lomonosov gave a good cha...
متن کاملOn Odd Cuts and Plane Multicommodity
Let T be an even subset of the vertices of a graph G. A T-cut is an edge-cutset of the graph which divides T into two odd sets. We prove that if G is bipartite, then the maximum number of disjoint !T-cuts is equal to the minimum cardinality of a set of edges which meets every T-cut. (A weaker form of this was proved by Edmonds and Johnson.) We deduce a solution to the real-valued multi-commodit...
متن کاملPolynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs
In this paper we study the maximum two-flow problem in vertexand edge-capacitated undirected STI-planar graphs, that is, planar graphs where the vertices of each terminal pair arc on the same face. For such graphs we provide an O(n) algorithm for finding a minimum two-cut and an O(n log n) algorithm for determining a maximum two-flow and show that the value of a maximum two-flow equals the valu...
متن کاملStraight-Line Triangle Representations via Schnyder Labelings
A straight-line triangle representation (SLTR) of a planar graph is a straight-line drawing such that all the faces including the outer face are triangles. Such a drawing can be viewed as a tiling of a triangle with triangles where the input graph is the skeletal structure. A characterization based on flat angle assignments, i.e., selections of angles of the graph that are of size π in the repr...
متن کاملCuts in Directed Planar Networks by Parallel C Omput at Ions
We reduce the exponent to 3 in the case when the network is embedded in the plane beforehand and to 4 otherwise. The reader is supposed to be familiar with graphs, planar graphs, multigraphs and so on (see [1]). We use the well-known method in a similar way as in [4] which consists in the fact that the problem of finding minimum cuts in a network can be reduced to the shortest path problem in i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 47 شماره
صفحات -
تاریخ انتشار 1993